a hybrid genetic algorithm for the open shop scheduling with makespan and total completion time

proper scheduling of tasks leads to optimum using of time and resources, inorder to obtaining best result. one of the most important and complicatedscheduling problems is open shop scheduling problem. there are n jobs in openshop scheduling problem which should be processed by m machines. purpose ofscheduling open shop problem is attaining to a suitable order of processing jobs byspecified machines so that makespan can be minimized. open shop schedulingproblem has very large and complex solution space and so is one of np-problems.till now, different algorithms have been presented for open shop schedulingproblem. in this paper, we have used combined genetics algorithm as a strategy forsolving scheduling open shop problem and compared proposed algorithm with dgaalgorithm. results show that the proposed algorithm has better effectiveness thandga algorithm.